Compressed Sensing Matrices From Fourier Matrices

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Toeplitz Block Matrices in Compressed Sensing

Recent work in compressed sensing theory shows that n×N independent and identically distributed (IID) sensing matrices whose entries are drawn independently from certain probability distributions guarantee exact recovery of a sparse signal with high probability even if n N . Motivated by signal processing applications, random filtering with Toeplitz sensing matrices whose elements are drawn fro...

متن کامل

Adaptive Compressed Sensing Using Sparse Measurement Matrices

Compressed sensing methods using sparse measurement matrices and iterative message-passing recovery procedures are recently investigated due to their low computational complexity and excellent performance. The design and analysis of this class of methods is inspired by a large volume of work on sparsegraph codes such as Low-Density Parity-Check (LDPC) codes and the iterative Belief-Propagation ...

متن کامل

Sparsification of Matrices and Compressed Sensing

Compressed sensing is a relatively new signal processing technique whereby the limits proposed by the Shannon-Nyquist theorem can be exceeded under certain conditions imposed upon the signal. Such conditions occur in many real-world scenarios, and compressed sensing has emerging applications in medical imaging, big data, and statistics. Finding practical matrix constructions and computationally...

متن کامل

Computable performance guarantees for compressed sensing matrices

The null space condition for ℓ1 minimization in compressed sensing is a necessary and sufficient condition on the sensing matrices under which a sparse signal can be uniquely recovered from the observation data via ℓ1 minimization. However, verifying the null space condition is known to be computationally challenging. Most of the existing methods can provide only upper and lower bounds on the p...

متن کامل

Symmetric Toeplitz-Structured Compressed Sensing Matrices

Abstract How to construct a suitable measurement matrix is still an open question in compressed sensing. A significant part of the recent work is that the measurement matrices are not completely random on the entries but exhibit considerable structure. In this paper, we proved that the symmetric Toeplitz matrix and its transforms can be used as measurement matrix and recovery signal with high p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 2015

ISSN: 0018-9448,1557-9654

DOI: 10.1109/tit.2014.2375259